Computing Deform Closure Grasps
نویسندگان
چکیده
In prior work, we extended the well-known form closure grasp framework for rigid parts to a class of deformable parts, modeled as frictionless polygons with a finite element mesh and given stiffness matrix. We define the D-space (deformationspace) of a part as the C-space of all its mesh nodes and deform closure in terms of the work needed to release the part from a set of finger contacts. In the present paper, we define a measure of grasp quality for two-point deformclosure grasps. This metric is based on balancing the potential energy needed to release the part against the potential energy that would result in plastic deformation. Given two jaw contacts at the perimeter nodes, we give a numerical algorithm to determine the optimal jaw separation based on this metric. For a part with n mesh nodes and p perimeter nodes, the algorithm computes an approximation to the optimal separation in time O(n p + ( p/ε ) log p).
منابع مشابه
D-space and Deform Closure Grasps of Deformable Parts
– Building on the well-established form closure framework for holding rigid parts, this paper proposes a new framework for holding deformable parts. We consider the class of deformable parts that can be modeled as linearly elastic polygons with a triangular finite element mesh and given stiffness matrix. We define the D-space (deformation-space) of a part as the C-space of all its mesh nodes. F...
متن کاملGoldberg D - space and Deform Closure Grasps of Deformable Parts
Building on the well-established form closure framework for holding rigid parts, in this paper we propose a new framework for holding deformable parts. We consider the class of deformable parts that can be modeled as linearly elastic polygons with a triangular finite element mesh and given stiffness matrix. We define the D-space (deformation-space) of a part as the C-space of all its mesh nodes...
متن کاملNew Techniques for Computing Four-Finger-Force-Closure Grasps of Polyhedral Objects
It was shown in 12] that four-nger force-closure grasps fall into three categories: concurrent, pencil, and regulus grasps. We propose new techniques for computing these three types of grasps. We have implemented them and present examples.
متن کاملOn computing three-finger force-closure grasps of 2-D and 3-D objects
In this paper, we present a novel algorithm for computing three-finger force-closure grasps of two-dimensional (2-D) and three-dimensional (3-D) objects. In the case of a robot hand with three hard fingers and point contact with friction, new necessary and sufficient conditions for 2-D and 3-D equilibrium and force-closure grasps have been deduced, and a corresponding algorithm for computing fo...
متن کاملFinger Form - Closure Grasps on Polygonal Objects
This paper presents an efficient algorithm for computing all n-finger form-closure grasps on a polygonal object based on a new sufficient and necessary condition for form-closure. With this new condition, it is possible to transfer the problem of computing the form-closure grasp in R3 to one in R1. We demonstrate that the non-form-closure grasps consist of two convex polytopes in the space of n...
متن کامل